Combinatorics of lattice paths with and without spikes

نویسنده

  • A. González-Arroyo
چکیده

We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label equivalence classes which allow a rearrangement of the sum over paths. The basic combinatorial quantities of this construction are given. These formulas are useful when performing strong coupling (hopping parameter) expansions of lattice models. Some applications are described. PACS: 11.15.Ha, 11.15.Me, 05.40.Fb

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Flagged Cauchy Determinant

We consider a flagged form of the Cauchy determinant, for which we provide a combinatorial interpretation in terms of nonintersecting lattice paths. In combination with the standard determinant for the enumeration of nonintersecting lattice paths, we are able to give a new proof of the Cauchy identity for Schur functions. Moreover, by choosing different starting and end points for the lattice p...

متن کامل

Bi-banded paths, a bijection and the Narayana numbers

We find a bijection between bi-banded paths and peak-counting paths, applying to two classes of lattice paths including Dyck paths. Thus we find a new interpretation of Narayana numbers as coefficients of weight polynomials enumerating bi-banded Dyck paths, which class of paths has arisen naturally in previous literature in a solution of the stationary state of the ‘TASEP’ stochastic process.

متن کامل

Characterization of signed paths and cycles admitting minus dominating function

If G = (V, E, σ) is a finite signed graph, a function f : V → {−1, 0, 1} is a minusdominating function (MDF) of G if f(u) +summation over all vertices v∈N(u) of σ(uv)f(v) ≥ 1 for all u ∈ V . In this paper we characterize signed paths and cycles admitting an MDF.

متن کامل

Lattices of Paths: Representation Theory and Valuations

We study some distributive lattices arising in the combinatorics of lattice paths. In particular, for the Dyck, Motzkin and Schröder lattices we describe the spectrum and we determine explicitly the Euler characteristic in terms of natural parameters of lattice paths. AMS Classification: Primary: 06D05; Secondary: 06A07.

متن کامل

Where Should I Open My Restaurant?

We answer a question in real estate that is a variation of a problem that arises in many combinatorics and discrete mathematics courses. There are three things that matter in property: location, location, location. Unknown. Possibly Lord Samuel of Britain [8] There is a lot of truth in this opening quote, especially applied to commercial real estate. If you want your restaurant to succeed, cust...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008